A Daptive a Utomata for G Rammar B Ased T Ext C Ompression
نویسندگان
چکیده
The Internet and the ubiquitous presence of computing devices anywhere is generating a continuously growing amount of information. However, the information entropy is not uniform. It allows the use of data compression algorithms to reduce the demand for more powerful processors and larger data storage equipment. This paper presents an adaptive rule-driven device the adaptive automata as the device to identify repetitive patterns to be compressed in a grammar based lossless data compression scheme.
منابع مشابه
On natural homomorphisms of local cohomology modules
Let $M$ be a non-zero finitely generated module over a commutative Noetherian local ring $(R,mathfrak{m})$ with $dim_R(M)=t$. Let $I$ be an ideal of $R$ with $grade(I,M)=c$. In this article we will investigate several natural homomorphisms of local cohomology modules. The main purpose of this article is to investigate when the natural homomorphisms $gamma: Tor^{R}_c(k,H^c_I(M))to kotim...
متن کاملMG7: A fast horizontally scalable tool based on cloud computing and graph databases for microbial community profiling
Methods: MG7 i s a n ope n s ource t ool i mplemented i n J ava a nd Scala, ba sed on c loud c omputing ( Amazon W eb S ervices). The g raph da ta platform B io4j ( www.bio4j.com) i s us ed f or r etrieving t axonomy r elated information, w hile N ispero ( http://ohnosequences.com/nispero) i s used f or distributing and coordinating compute tasks. Results: MG7 i s a n ope n-source, f ast a nd h...
متن کاملA Formal Description of Arabic Syntax in Definite Clause Grammar
Arabic has some special syntax features which lead to complex syntax structures. We have developed a formal description of Arabic syntax in Definite Clause Grammar. This grarnrnar is characterized by its h igh descriptive power due to its dual formulat ion in terms of functions and in terms of grammatical categories. The developed g rammar has a high coverage of Arabic language and has context ...
متن کاملThe Weak Generative Capacity of Parenthesis-Free Categorial Grammars
We study the weak generative capacity of a class of parenthesis-free categorial grammars derived /torn those of Aries and Steedman by varying the set of reduction rules. With forward cancellation as the only rule, the grammars are weakly equivalent to context-free grammars. When a backward combination rule is added, it is no longer possible to ohlain all the context-free languages. With suitabl...
متن کاملBiclusters Evaluation Based on Shifting and Scaling Patterns
M icroarray tech niq ues h av e motiv ated th e d ev elop of d iff erent meth od s to ex tract useful information from a b iolog ical point of v iew . B iclustering alg orith ms ob tain a set of g enes w ith th e same b eh av iour ov er a g roup of ex perimental cond itions from g ene ex pression d ata. In ord er to ev aluate th e q uality of a b icluster, it is useful to id entify specifi c te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017